Simplification of Cylindrical Algebraic Formulas
نویسندگان
چکیده
For a set S of cells in a cylindrical algebraic decomposition of R, we introduce the notion of generalized cylindrical algebraic formula (GCAF) associated with S. We propose a multi-level heuristic algorithm for simplifying the cylindrical algebraic formula associated with S into a GCAF. The heuristic strategies are motivated by solving examples coming from the application of automatic loop transformation. While the algorithm works well on these examples, its effectiveness is also illustrated by examples from other application domains.
منابع مشابه
Comparing Different Projection Operators in Cylindrical Algebraic Decomposition for SMT Solving
Satisfiability-modulo-theories (SMT) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving for non-linear real arithmetic, the cylindrical algebraic decomposition (CAD) can be embedded as a theory solver to solve sets (conjunctions) of polynomial constraints. When developing such a CAD theory solver, a design choice is given by the selection of th...
متن کاملAlgebraic Simplification Techniques for Propositional Satisfiability
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instance. This ability can actually be essential for specific and hard classes of instances. The objective of this paper is to propose new simplification techniques for Conjunctive Normal Form (CNF) formulas. Experimental r...
متن کاملPractical simplification of elementary functions using CAD
Simplification has been long recognised to be a fundamental problem within computer algebra. One of the main concerns of this paper is to investigate the feasibility of the simplification system proposed by the authors in ISSAC 2004. This will be based on a set of examples which one would might realistically meet in practice. Cylindrical Algebraic Decomposition (CAD) is an integral part of this...
متن کاملComparing Different Projection Operators in the Cylindrical Algebraic Decomposition for SMT Solving
Satisfiability-modulo-theories (SMT) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving for non-linear real arithmetic, the cylindrical algebraic decomposition (CAD) can be embedded as a theory solver to solve sets (conjunctions) of polynomial constraints. When developing such a CAD theory solver, a design choice is given by the selection of th...
متن کاملAn Overview of QEPCAD B: a Tool for Real Quantifier Elimination and Formula Simplification
This paper describes the basic functionality of Qepcad b, a system for computing with semi-algebraic sets via Cylindrical Algebraic Decomposition (CAD). Qepcad b is an interactive command-line based program, written in C, and built on top of the Saclib library. It extends and improves the Qepcad system. The article focuses on using Qepcad b to solve problems, describing the basic facilities off...
متن کامل